Graph minor

Results: 171



#Item
31Multiply chorded cycles Ronald Gould∗ Paul Horn†  Colton Magnant‡

Multiply chorded cycles Ronald Gould∗ Paul Horn† Colton Magnant‡

Add to Reading List

Source URL: web.cs.du.edu

Language: English - Date: 2012-10-18 11:53:54
32Minors on Campus GuidelinesDOCX;2)

Minors on Campus GuidelinesDOCX;2)

Add to Reading List

Source URL: www.ou.edu

Language: English - Date: 2016-07-11 14:26:39
33Graph minors, decompositions and algorithms (Lecture notes) Jiˇr´ı Fiala Department of Applied Mathematics, Charles University, Prague

Graph minors, decompositions and algorithms (Lecture notes) Jiˇr´ı Fiala Department of Applied Mathematics, Charles University, Prague

Add to Reading List

Source URL: kam.mff.cuni.cz

Language: English - Date: 2014-06-02 07:40:12
34Clustered planarity testing revisited ¨ ot ¨ or ¨ Palv ´ olgyi ¨

Clustered planarity testing revisited ¨ ot ¨ or ¨ Palv ´ olgyi ¨

Add to Reading List

Source URL: kam.mff.cuni.cz

Language: English - Date: 2014-09-23 19:06:10
35Reverse Mathematics and the Coloring Number of Graphs Matthew A. Jura, Ph.D. University of Connecticut, 2009

Reverse Mathematics and the Coloring Number of Graphs Matthew A. Jura, Ph.D. University of Connecticut, 2009

Add to Reading List

Source URL: www.math.uconn.edu

Language: English - Date: 2009-06-07 10:48:53
36Decomposition by maximal cliques and forbidden subgraphs for path graphs Hugo Nobrega1 COPPE/Engenharia de Sistemas e Computa¸ca ˜o Universidade Federal do Rio de Janeiro

Decomposition by maximal cliques and forbidden subgraphs for path graphs Hugo Nobrega1 COPPE/Engenharia de Sistemas e Computa¸ca ˜o Universidade Federal do Rio de Janeiro

Add to Reading List

Source URL: dl.dropboxusercontent.com

Language: English
37Plenary Talks J.Chuzhoy (Toyota Technological Institute at Chicago) Polynomial Bounds for the Grid-Minor Theorem Abstract: One of the key results in Robertson and Seymour’s seminal work on graph minors is the Grid-Mino

Plenary Talks J.Chuzhoy (Toyota Technological Institute at Chicago) Polynomial Bounds for the Grid-Minor Theorem Abstract: One of the key results in Robertson and Seymour’s seminal work on graph minors is the Grid-Mino

Add to Reading List

Source URL: www.fields.utoronto.ca

Language: English - Date: 2013-07-16 14:10:32
    38Using discharging methods For the coloring of sparse graphs M2 internship Benjamin Lévêque & Alexandre Pinlou Marthe Bonamy LIRMM, Montpellier

    Using discharging methods For the coloring of sparse graphs M2 internship Benjamin Lévêque & Alexandre Pinlou Marthe Bonamy LIRMM, Montpellier

    Add to Reading List

    Source URL: www.labri.fr

    Language: English - Date: 2015-12-18 08:48:25
    39Model Checking for Successor-Invariant First-Order Logic on Minor-Closed Graph Classes Kord Eickmeyer National Inst. of Informatics, Tokyo

    Model Checking for Successor-Invariant First-Order Logic on Minor-Closed Graph Classes Kord Eickmeyer National Inst. of Informatics, Tokyo

    Add to Reading List

    Source URL: logic.las.tu-berlin.de

    Language: English - Date: 2015-06-17 12:07:41
      40Region Counting Graphs Jean Cardinal∗ S´ebastien Collette†  Abstract

      Region Counting Graphs Jean Cardinal∗ S´ebastien Collette† Abstract

      Add to Reading List

      Source URL: www.ulb.ac.be

      Language: English - Date: 2011-02-08 09:21:41